A Dynamic Users’ Interest Discovery Model with Distributed Inference Algorithm
نویسندگان
چکیده
منابع مشابه
Author-Topic over Time (AToT): A Dynamic Users' Interest Model
One of the key problems in upgrading information services towards knowledge services is to automatically mine latent topics, users’ interests and their evolution patterns from large-scale S&T literatures. Most of current methods are devoted to either discover static latent topics and users’ interests, or to analyze topic evolution only from intrafeatures of documents, namely text content withou...
متن کاملA Model for Summarizing Celebrities with Microblogging Users' Interest
With the rapid development of Web 2.0, microblogging such as twitter is increasingly becoming an important source of up-to-date topics about what is happening in the world. Specially, it becomes one of the main ways for users to understand some celebrities. However, the huge volume of information makes troubles for people to get what they really want. How to filter out needless information thro...
متن کاملDynamic Time Warping Algorithm with Distributed Systems
Distributed computing is the method of splitting a large problem into smaller pieces and allocating the workload among many computers. These individual computers process their portions of the problem, and the results are combined together to form a solution for the original problem. At present, Distributed computing systems can be broadly classified into two methods, namely Grid computing and V...
متن کاملModel and Algorithm for Dynamic Multi-Objective Distributed Optimization
Many problems in multi-agent systems can be represented as a Distributed Constraint Optimization Problem (DCOP) where the goal is to find the best assignment to variables in order to minimize the cost. More complex problems including several criteria can be represented as a Multi-Objective Distributed Constraint Optimization Problem (MODCOP) where the goal is to optimize several criteria at the...
متن کاملA Distributed Clustering Algorithm for Dynamic Networks
We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect data and move according to a random walk traversal scheme. Their task consists in (i) creating a cluster with the nodes it discovers and (ii) managing the cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2014
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2014/280892